Keypoint Changes for Fast Human Activity Recognition

نویسندگان

چکیده

Abstract Human activity recognition has been an open problem in computer vision for almost 2 decades. During this time, there have many approaches proposed to solve problem, but very few managed it a way that is sufficiently computationally efficient real-time applications. Recently, changed, with keypoint-based methods demonstrating high degree of accuracy low computational cost. These take given image and return set joint locations each individual within image. In order achieve performance, sparse representation these features over time frame required classification. Previous achieved using reduced number keypoints, approach gives less robust the individual’s body pose may limit types can be detected. We present novel method reducing size feature set, by calculating Euclidian distance direction keypoint changes across frames. This allows meaningful individuals movements time. show achieves on par current state-of-the-art methods, while performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Keypoint Signatures for Fast Learning and Recognition

Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the training itself is usually relatively slow and performed offline. Although methods have recently been proposed to train the classifier online, they can only learn a very limited number of new keypoints. This represents a handic...

متن کامل

Fast Simultaneous Tracking and Recognition Using Incremental Keypoint Matching

This paper presents a unified approach to object recognition and object tracking, combining local feature matching with optical flow. Like many traditional recognition algorithms, the one described here implements recognition by matching detected image patches against a database of known objects. This algorithm, however, matches keypoints incrementally, meaning that it only tests a few keypoint...

متن کامل

A Convolutional Treelets Binary Feature Approach to Fast Keypoint Recognition

Fast keypoint recognition is essential to many vision tasks. In contrast to the classification-based approaches [1, 2], we directly formulate the keypoint recognition as an image patch retrieval problem, which enjoys the merit of finding the matched keypoint and its pose simultaneously. A novel convolutional treelets approach is proposed to effectively extract the binary features from the patch...

متن کامل

Fast Human Activity Recognition in Lifelogging

This paper addresses the problem of fast Human Activity Recognition (HAR) in visual lifelogging. We identify the importance of visual features related to HAR and we specifically evaluate the HAR discrimination potential of Colour Histograms and Histogram of Oriented Gradients. In our evaluation we show that colour can be a low-cost and e↵ective means of low-cost HAR when performing single-user ...

متن کامل

Keypoint Extraction and Selection for Object Recognition

In order to improve the performance of affine invariant detectors, approaches that combine different keypoint extraction methods can be found in literature. However, such a combining has two major drawbacks: a high computational cost in matching similar objects, and a large number of false positives because only a relatively small subset of those keypoints is really discriminative. In this pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SN computer science

سال: 2023

ISSN: ['2661-8907', '2662-995X']

DOI: https://doi.org/10.1007/s42979-023-02063-x